ঘাসফুল' কবিতাটির রচয়িতা কে?

Question: Which of the following data structures operates strictly on a Last-In, First-Out (LIFO) basis?

Options:

    
• A) Queue
    
• B) Stack
    
• C) Array
    
• D) Binary Search Tree

Correct Answer: B) Stack

Explanation:

A Stack is an abstract data type that serves as a collection of elements, with two principal operations: push (which adds an element) and pop (which removes the most recently added element). Therefore, the last element placed into the stack is the first one to be removed (LIFO).

Why the other options are incorrect:

    
• Queue: Follows the First-In, First-Out (FIFO) principle, where elements are inserted at the rear and removed from the front.
    
• Array: Provides random access to elements via numerical indices and does not enforce a strict insertion/removal sequence.
    
• Binary Search Tree: A hierarchical, node-based data structure arranged based on comparative values, not entry order.